#include"Slist.h"

int main()
{
 /*SLT_N * node1 = (SLT_N*)malloc(sizeof(SLT_N)); 
 node1->next = NULL; node1->node = 0;*/

	SLT_N* node1 = NULL;

 push_front(&node1, 1);
 printf_slist(node1);

 push_back(&node1,2);
 printf_slist(node1);
 //pop_front(&node1);
 //printf_slist(node1);
 //pop_back(&node1);
 //pop_back(&node1);
 //insert_anywhere_front(&node1,node1,99);
 printf_slist(node1);
 insert_anywhere_back(&node1, node1, 100);
 printf_slist(node1);
 delect_anywhere(&node1, node1);
 printf_slist(node1);

 destory(&node1);
 return 0;
}